A variant of the Erdös-Rényi random graph process

Abstract: We consider a natural variant of the Erdös-Rényi inspired by the combinatorial data fusion problem that itself is connected to a number of important problems in graph theory. We will show that a phase transition occurs when the number of special vertices is roughly $n^{1/3}$, where $n$ is the number of vertices. This is joint work with Adam Logan and Mike Molloy

combinatorics

Audience: researchers in the topic

New York combinatorics seminar